Query Mesh: MultiRoute

نویسندگان

  • Rimma Nehme
  • Karen Works
  • Elke Rundensteiner
  • Elisa Bertino
  • Rimma V. Nehme
  • Karen E. Works
  • Elke A. Rundensteiner
چکیده

We propose to demonstrate a practical alternative approach to the current state-of-the-art query processing techniques, called the “Query Mesh” (or QM, for short). The main idea of QM is to compute multiple routes (i.e., query plans), each designed for a particular subset of data with distinct statistical properties. Based on the execution routes and the data characteristics, a classifier model is induced and is used to partition new data tuples to assign the best routes for their processing. We propose to demonstrate the QM framework in the streaming context using our demo application, called the “Ubi-City”. We will illustrate the innovative features of QM, including: the QM optimization with the integrated machine learning component, the QM execution using the efficient “Self-Routing Fabric” infrastructure, and finally, the QM adaptive component that performs the online adaptation of QM with near-zero runtime overhead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Mesh: An Efficient Multi-Route Approach to Query Optimization

In most database systems, traditional and stream systems alike, the optimizer picks a single query plan for all data based on the overall statistics of the data. It has however been repeatedly observed that real-life datasets are non-uniform. Selecting a single execution plan may result in a query execution that is ineffective for possibly large portions of the actual data. In this paper, we pr...

متن کامل

High Performance Stream Query Processing With Correlation-Aware Partitioning

State-of-the-art optimizers produce one single optimal query plan for all stream data, in spite of such a singleton plan typically being sub-optimal or even poor for highly correlated data. Recently a new stream processing paradigm, called multi-route approach, has emerged as a promising approach for tackling this problem. Multiroute first divides data streams into several partitions and then c...

متن کامل

A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts

A classical flow is a nonnegative linear combination of unit flows along simple paths. A multiroute flow, first considered by Kishimoto and Takeuchi, generalizes this concept. The basic building blocks are not single paths with unit flows but rather tuples consisting of k edge disjoint paths, each path with a unit flow. A multiroute flow is a nonnegative linear combination of such tuples. We pr...

متن کامل

Two-Commodity Multiroute Maximum Flow Problem

We consider a two-commodity multiroute maximum flow problem in an undirected network— a generalization of the standard two-commodity maximum flow problem. An efficient combinatorial algorithm, which always guarantees a quarter-integer solution when the capacities are integers, is devised to solve a special case based on a novel extension of the augmentingpath technique. Partial results are repo...

متن کامل

Text-Based Medical Case Retrieval Using MeSH Ontology

Our approach to the ImageCLEF medical case retrieval task consists of text-only retrieval combined with utilizing the Medical Subject Headings (MeSH) ontology. MeSH terms extracted from the query are used for query expansion or query term weighting. MeSH annotations of documents available from PubMed Central are added to the corpus. Retrieval results improve slightly upon full-text retrieval.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015